Probabilistic complexity theory - PDFSEARCH.IO - Document Search Engine

Probabilistic complexity theory
Results: 385

#	Item
311	A Scalable and Nearly Uniform Generator of SAT Witnesses? Supratik Chakraborty1 , Kuldeep S. Meel2 , and Moshe Y. Vardi2 1 arXiv:1304.1584v1 [cs.LO] 4 Apr 2013 Add to Reading List Source URL: arxiv.org Language: English - Date: 2013-04-07 20:21:28 Search algorithms Cryptographic hash functions Analysis of algorithms Probabilistic complexity theory Randomized algorithm Algorithm PP Hash function Universal hashing Theoretical computer science Applied mathematics Computational complexity theory
312	Max-CSP Semi-Definite programming Inapproximability results Classification On the efficient approximability of constraint Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 2007-09-24 02:55:53 Complexity classes Mathematical optimization Constraint satisfaction problem Approximation algorithm NP-complete P versus NP problem Bounded-error probabilistic polynomial Constraint satisfaction NP Theoretical computer science Computational complexity theory Applied mathematics
313	02 INFORMATION ABOUT PRINCIPAL INVESTIGATORS/PROJECT DIRECTORS(PI/PD) and co-PRINCIPAL INVESTIGATORS/co-PROJECT DIRECTORS Submit only ONE copy of this form for each PI/PD and co-PI/PD identified on the proposal. The form Add to Reading List Source URL: faculty.uml.edu Language: English - Date: 2007-07-09 23:40:48 Randomness Numerical analysis Probabilistic complexity theory Cryptography Grant Random variable Monte Carlo method Random walk Low-discrepancy sequence Mathematics Statistics Probability and statistics
314	Research Statement Salil Vadhan September 2006 Add to Reading List Source URL: people.seas.harvard.edu Language: English - Date: 2009-08-20 14:10:08 Probabilistic complexity theory Cryptographic protocols Computational complexity theory Randomness Complexity classes Salil Vadhan Zero-knowledge proof Probabilistically checkable proof Pseudorandomness Theoretical computer science Applied mathematics Cryptography
315	Theoretical Justification of Popular Link Prediction Heuristics Purnamrita Sarkar Carnegie Mellon University Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2011-04-16 14:31:09 Network theory Analysis of algorithms Probabilistic complexity theory Randomized algorithm Shortest path problem Graph theory Networks Theoretical computer science Mathematics Computational complexity theory
316	PVeStA: A Parallel Statistical Model Checking and Quantitative Analysis Tool Musab AlTurki and Jos´e Meseguer Add to Reading List Source URL: maude.cs.uiuc.edu Language: English - Date: 2011-05-18 16:24:10 Probabilistic complexity theory Model checking Monte Carlo method Markov chain Stochastic Randomized algorithm Probabilistic CTL Probability and statistics Theoretical computer science Statistics
317	Axiomatising physical experiments as oracles to algorithms Edwin J. Beggsa , Jos´e F´elix Costab∗ , and John V. Tuckerc a Department of Mathematics, College of Sciences, Swansea University, Swansea SA2 8PP, Wales, Un Add to Reading List Source URL: www-compsci.swan.ac.uk Language: English - Date: 2012-04-11 07:58:28 Computability theory Complexity classes Models of computation Alan Turing Oracle machine Turing reduction John V. Tucker Probabilistic Turing machine Reduction Theoretical computer science Applied mathematics Computational complexity theory
318	Tight Bounds for Distributed Selection Fabian Kuhn Institute of Theoretical Computer Science ETH Zurich, Switzerland Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2007-04-02 04:50:42 Analysis of algorithms Probabilistic complexity theory Randomized algorithm Selection algorithm B-tree Breadth-first search Time complexity Self-organizing list Tango tree Theoretical computer science Computational complexity theory Applied mathematics
319	The Price of Being Near-Sighted Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer {kuhn,moscitho,wattenhofer}@tik.ee.ethz.ch Computer Engineering and Networks Laboratory, ETH Zurich, 8092 Zurich, Switzerland Abstract Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2005-10-11 11:22:41 Spanning tree NP-complete problems Graph theory Operations research Probabilistic complexity theory Randomized algorithm Linear programming Connectivity Minimum spanning tree Theoretical computer science Computational complexity theory Mathematics
320	International Experts in Claims Analysis, Dispute Resolution, and Project Management for Process, Oil & Gas, Pipeline, Power, Industrial, Add to Reading List Source URL: www.long-intl.com Language: English - Date: 2013-05-23 17:20:30 Mathematics Operations research Monte Carlo method Numerical analysis Probabilistic complexity theory Simulation Probability distribution Applied mathematics Probability and statistics Computational physics

UPDATE